منابع مشابه
Accumulating bindings
We give a Haskell implementation of Filinski’s normalisation by evaluation algorithm for the computational lambda-calculus with sums. Taking advantage of extensions to the GHC compiler, our implementation represents object language types as Haskell types and ensures that type errors are detected statically. Following Filinski, the implementation is parameterised over a residualising monad. The ...
متن کاملMarkov Models for Accumulating Mutations
We introduce and analyze a waiting time model for the accumulation of genetic changes. The continuous time conjunctive Bayesian network is defined by a partially ordered set of mutations and by the rate of fixation of each mutation. The partial order encodes constraints on the order in which mutations can fixate in the population, shedding light on the mutational pathways underlying the evoluti...
متن کاملOn the Data { Accumulating Paradigm
In the data{accumulating paradigm, the input is an endless stream. A computation is considered to be nished when all the already received data are processed before another datum arrives. We study sorting algorithms in this paradigm. First, we consider the data arrival law as being polynomial in time. We prove the existence of an upper bound on the running time, and hence on the amount of proces...
متن کاملSequential biases in accumulating evidence
Whilst it is common in clinical trials to use the results of tests at one phase to decide whether to continue to the next phase and to subsequently design the next phase, we show that this can lead to biased results in evidence synthesis. Two new kinds of bias associated with accumulating evidence, termed 'sequential decision bias' and 'sequential design bias', are identified. Both kinds of bia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2011
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.332.6031.768-d